Ela Structured Qr Algorithms for Hamiltonian Symmetric Matrices
نویسنده
چکیده
Efficient, backward-stable, doubly structure-preserving algorithms for the Hamiltonian symmetric and skew-symmetric eigenvalue problems are developed. Numerical experiments confirm the theoretical properties of the algorithms. Also developed are doubly structure-preserving Lanczos processes for Hamiltonian symmetric and skew-symmetric matrices.
منابع مشابه
Structured QR algorithms for Hamiltonian symmetric matrices
Efficient, backward-stable, doubly structure-preserving algorithms for the Hamiltonian symmetric and skew-symmetric eigenvalue problems are developed. Numerical experiments confirm the theoretical properties of the algorithms. Also developed are doubly structure-preserving Lanczos processes for Hamiltonian symmetric and skew-symmetric matrices.
متن کاملEla Structured Conditioning of Matrix Functions
STRUCTURED CONDITIONING OF MATRIX FUNCTIONS∗ PHILIP I. DAVIES† Abstract. The existing theory of conditioning for matrix functions f(X):Cn×n → Cn×n does not cater for structure in the matrix X. An extension of this theory is presented in which when X has structure, all perturbations of X are required to have the same structure. Two classes of structured matrices are considered, those comprising ...
متن کاملEla Perturbation of Purely Imaginary Eigenvalues of Hamiltonian Matrices under Structured Perturbations∗
The perturbation theory for purely imaginary eigenvalues of Hamiltonian matrices under Hamiltonian and non-Hamiltonian perturbations is discussed. It is shown that there is a substantial difference in the behavior under these perturbations. The perturbation of real eigenvalues of real skew-Hamiltonian matrices under structured perturbations is discussed as well and these results are used to ana...
متن کاملEla Structure Preserving Algorithms for Perplectic
Structured real canonical forms for matrices in Rn×n that are symmetric or skewsymmetric about the anti-diagonal as well as the main diagonal are presented, and Jacobi algorithms for solving the complete eigenproblem for three of these four classes of matrices are developed. Based on the direct solution of 4 × 4 subproblems constructed via quaternions, the algorithms calculate structured orthog...
متن کاملA multiple shift QR-step for structured rank matrices
Eigenvalue computations for structured rank matrices are the subject of many investigations nowadays. There exist methods for transforming matrices into structured rank form, QR-algorithms for semiseparable and semiseparable plus diagonal form, methods for reducing structured rank matrices efficiently to Hessenberg form and so forth. Eigenvalue computations for the symmetric case, involving sem...
متن کامل